Quarter-regular biembeddings of Latin squares

نویسندگان

  • Diane Donovan
  • Ales Drápal
  • Mike J. Grannell
  • Terry S. Griggs
  • James G. Lefevre
چکیده

In this talk I will review the concept of the biembedding of two latin squares. Of particular interest will be the regular biemedding of two isomorphic copies of the latin square corresponding to the cyclic group of order n, denoted Cn. Grannell and Griggs have shown that, for all n, a regular biembedding exists, and in addition, that the automorphism group of the regular biembedding has order 12n. Grannell and Griggs have also developed a doubling construction in which the latin squares of order n can be used to construct a biembedding of latin squares of order 2n. In this talk I will apply this construction to the regular biembedding of Cn. The result is surprising in that the doubling construction produces a biembedding of two copies of C2n, however the automorphism group of this biembedding has order 12(2n)/4 = 12n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Biembeddings of Latin Squares

A known construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is re-examined from the viewpoint of the underlying Latin squares. This facilitates biembeddings of a wide variety of Latin squares, including those formed from the Cayley tables of the elementary Abelian 2-groups Ck 2 (k 6= 2). In turn, these biembeddings enable us to increase the best known ...

متن کامل

Triangulations of orientable surfaces by complete tripartite graphs

Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings of Latin squares. We show that if n is prime there are at least e ln n−n(1+o(1)) nonisomorphic biembeddings of cyclic Latin squares of order n. If n = kp, where p is a large prime number, then the number of nonisomorphic biembeddings of cyclic Latin squares of order n is at least e ln p−p(1+ln . ...

متن کامل

A Construction for Biembeddings of Latin Squares

An existing construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is extended and then re-examined from the viewpoint of the underlying Latin squares. We prove that this generalization gives embeddings which are not isomorphic to any of those produced by the original construction.

متن کامل

Third-regular biembeddings of Latin squares

For each positive integer n ≥ 2, there is a well-known regular orientable Hamiltonian embedding of Kn,n, and this generates a regular face 2-colourable triangular embedding of Kn,n,n. In the case n ≡ 0 (mod 8), and only in this case, there is a second regular orientable Hamiltonian embedding of Kn,n. The current paper presents an analysis of the face 2-colourable triangular embedding of Kn,n,n ...

متن کامل

Biembeddings of Metacyclic Groups and Triangulations of Orientable Surfaces by Complete Graphs

For each integer n > 3, n 6= 4, for each odd integer m > 3, and for any λ ∈ Zn of (multiplicative) order m′ where m′ | m, we construct a biembedding of Latin squares in which one of the squares is the Cayley table of the metacyclic group Zm nλ Zn. This extends the spectrum of Latin squares known to be biembeddable. The best existing lower bounds for the number of triangular embeddings of a comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 310  شماره 

صفحات  -

تاریخ انتشار 2010